TSTP Solution File: SEV233^5 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SEV233^5 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% Computer : n026.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Tue Jul 19 17:35:48 EDT 2022
% Result : Theorem 0.19s 0.38s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 6
% Syntax : Number of formulae : 63 ( 49 unt; 5 typ; 0 def)
% Number of atoms : 259 ( 64 equ; 0 cnn)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 291 ( 72 ~; 42 |; 17 &; 137 @)
% ( 0 <=>; 23 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 56 ( 0 ^ 56 !; 0 ?; 56 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_cD,type,
cD: $i > $o ).
thf(tp_cE,type,
cE: $i > $o ).
thf(tp_sK1_Xx,type,
sK1_Xx: $i > $o ).
thf(tp_sK2_SY5,type,
sK2_SY5: $i ).
thf(tp_sK3_SY6,type,
sK3_SY6: $i ).
thf(1,conjecture,
! [Xx: $i > $o] :
( ! [Xx0: $i] :
( ( Xx @ Xx0 )
=> ( ( cD @ Xx0 )
& ( cE @ Xx0 ) ) )
=> ( ! [Xx0: $i] :
( ( Xx @ Xx0 )
=> ( cD @ Xx0 ) )
& ! [Xx0: $i] :
( ( Xx @ Xx0 )
=> ( cE @ Xx0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM46_pme) ).
thf(2,negated_conjecture,
( ( ! [Xx: $i > $o] :
( ! [Xx0: $i] :
( ( Xx @ Xx0 )
=> ( ( cD @ Xx0 )
& ( cE @ Xx0 ) ) )
=> ( ! [Xx0: $i] :
( ( Xx @ Xx0 )
=> ( cD @ Xx0 ) )
& ! [Xx0: $i] :
( ( Xx @ Xx0 )
=> ( cE @ Xx0 ) ) ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ! [Xx: $i > $o] :
( ! [Xx0: $i] :
( ( Xx @ Xx0 )
=> ( ( cD @ Xx0 )
& ( cE @ Xx0 ) ) )
=> ( ! [Xx0: $i] :
( ( Xx @ Xx0 )
=> ( cD @ Xx0 ) )
& ! [Xx0: $i] :
( ( Xx @ Xx0 )
=> ( cE @ Xx0 ) ) ) ) )
= $false ),
inference(unfold_def,[status(thm)],[2]) ).
thf(4,plain,
( ( ! [SY4: $i] :
( ( sK1_Xx @ SY4 )
=> ( ( cD @ SY4 )
& ( cE @ SY4 ) ) )
=> ( ! [SY5: $i] :
( ( sK1_Xx @ SY5 )
=> ( cD @ SY5 ) )
& ! [SY6: $i] :
( ( sK1_Xx @ SY6 )
=> ( cE @ SY6 ) ) ) )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[3]) ).
thf(5,plain,
( ( ! [SY4: $i] :
( ( sK1_Xx @ SY4 )
=> ( ( cD @ SY4 )
& ( cE @ SY4 ) ) ) )
= $true ),
inference(standard_cnf,[status(thm)],[4]) ).
thf(6,plain,
( ( ! [SY5: $i] :
( ( sK1_Xx @ SY5 )
=> ( cD @ SY5 ) )
& ! [SY6: $i] :
( ( sK1_Xx @ SY6 )
=> ( cE @ SY6 ) ) )
= $false ),
inference(standard_cnf,[status(thm)],[4]) ).
thf(7,plain,
( ( ! [SY5: $i] :
( ( sK1_Xx @ SY5 )
=> ( cD @ SY5 ) ) )
= $false ),
inference(split_conjecture,[split_conjecture(split,[])],[6]) ).
thf(8,plain,
( ( ! [SY6: $i] :
( ( sK1_Xx @ SY6 )
=> ( cE @ SY6 ) ) )
= $false ),
inference(split_conjecture,[split_conjecture(split,[])],[6]) ).
thf(9,plain,
( ( ~ ! [SY5: $i] :
( ( sK1_Xx @ SY5 )
=> ( cD @ SY5 ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[7]) ).
thf(10,plain,
( ( ~ ! [SY6: $i] :
( ( sK1_Xx @ SY6 )
=> ( cE @ SY6 ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[8]) ).
thf(11,plain,
( ( ( sK1_Xx @ sK2_SY5 )
& ~ ( cD @ sK2_SY5 ) )
= $true ),
inference(extcnf_combined,[status(esa)],[9]) ).
thf(12,plain,
( ( ( sK1_Xx @ sK3_SY6 )
& ~ ( cE @ sK3_SY6 ) )
= $true ),
inference(extcnf_combined,[status(esa)],[10]) ).
thf(13,plain,
( ( ! [SY4: $i] :
( ~ ( sK1_Xx @ SY4 )
| ( cD @ SY4 ) )
& ! [SY4: $i] :
( ~ ( sK1_Xx @ SY4 )
| ( cE @ SY4 ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[5]) ).
thf(14,plain,
( ( ! [SY4: $i] :
( ~ ( sK1_Xx @ SY4 )
| ( cD @ SY4 ) )
& ! [SY4: $i] :
( ~ ( sK1_Xx @ SY4 )
| ( cE @ SY4 ) ) )
= $true ),
inference(copy,[status(thm)],[13]) ).
thf(15,plain,
( ( ( sK1_Xx @ sK2_SY5 )
& ~ ( cD @ sK2_SY5 ) )
= $true ),
inference(copy,[status(thm)],[11]) ).
thf(16,plain,
( ( ~ ( ~ ! [SX0: $i] :
( ~ ( sK1_Xx @ SX0 )
| ( cD @ SX0 ) )
| ~ ! [SX0: $i] :
( ~ ( sK1_Xx @ SX0 )
| ( cE @ SX0 ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[14]) ).
thf(17,plain,
( ( ~ ( ~ ( sK1_Xx @ sK2_SY5 )
| ~ ~ ( cD @ sK2_SY5 ) ) )
= $true ),
inference(unfold_def,[status(thm)],[15]) ).
thf(18,plain,
( ( ~ ! [SX0: $i] :
( ~ ( sK1_Xx @ SX0 )
| ( cD @ SX0 ) )
| ~ ! [SX0: $i] :
( ~ ( sK1_Xx @ SX0 )
| ( cE @ SX0 ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[16]) ).
thf(19,plain,
( ( ~ ( sK1_Xx @ sK2_SY5 )
| ~ ~ ( cD @ sK2_SY5 ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[17]) ).
thf(20,plain,
( ( ~ ! [SX0: $i] :
( ~ ( sK1_Xx @ SX0 )
| ( cD @ SX0 ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[18]) ).
thf(21,plain,
( ( ~ ! [SX0: $i] :
( ~ ( sK1_Xx @ SX0 )
| ( cE @ SX0 ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[18]) ).
thf(22,plain,
( ( ~ ( sK1_Xx @ sK2_SY5 ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[19]) ).
thf(23,plain,
( ( ~ ~ ( cD @ sK2_SY5 ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[19]) ).
thf(24,plain,
( ( ! [SX0: $i] :
( ~ ( sK1_Xx @ SX0 )
| ( cD @ SX0 ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[20]) ).
thf(25,plain,
( ( ! [SX0: $i] :
( ~ ( sK1_Xx @ SX0 )
| ( cE @ SX0 ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[21]) ).
thf(26,plain,
( ( sK1_Xx @ sK2_SY5 )
= $true ),
inference(extcnf_not_neg,[status(thm)],[22]) ).
thf(27,plain,
( ( ~ ( cD @ sK2_SY5 ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[23]) ).
thf(28,plain,
! [SV1: $i] :
( ( ~ ( sK1_Xx @ SV1 )
| ( cD @ SV1 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[24]) ).
thf(29,plain,
! [SV2: $i] :
( ( ~ ( sK1_Xx @ SV2 )
| ( cE @ SV2 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[25]) ).
thf(30,plain,
( ( cD @ sK2_SY5 )
= $false ),
inference(extcnf_not_pos,[status(thm)],[27]) ).
thf(31,plain,
! [SV1: $i] :
( ( ( ~ ( sK1_Xx @ SV1 ) )
= $true )
| ( ( cD @ SV1 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[28]) ).
thf(32,plain,
! [SV2: $i] :
( ( ( ~ ( sK1_Xx @ SV2 ) )
= $true )
| ( ( cE @ SV2 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[29]) ).
thf(33,plain,
! [SV1: $i] :
( ( ( sK1_Xx @ SV1 )
= $false )
| ( ( cD @ SV1 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[31]) ).
thf(34,plain,
! [SV2: $i] :
( ( ( sK1_Xx @ SV2 )
= $false )
| ( ( cE @ SV2 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[32]) ).
thf(35,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[26,34,33,30]) ).
thf(36,plain,
( ( ! [SY4: $i] :
( ~ ( sK1_Xx @ SY4 )
| ( cD @ SY4 ) )
& ! [SY4: $i] :
( ~ ( sK1_Xx @ SY4 )
| ( cE @ SY4 ) ) )
= $true ),
inference(copy,[status(thm)],[13]) ).
thf(37,plain,
( ( ( sK1_Xx @ sK3_SY6 )
& ~ ( cE @ sK3_SY6 ) )
= $true ),
inference(copy,[status(thm)],[12]) ).
thf(38,plain,
( ( ~ ( ~ ! [SX0: $i] :
( ~ ( sK1_Xx @ SX0 )
| ( cD @ SX0 ) )
| ~ ! [SX0: $i] :
( ~ ( sK1_Xx @ SX0 )
| ( cE @ SX0 ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[36]) ).
thf(39,plain,
( ( ~ ( ~ ( sK1_Xx @ sK3_SY6 )
| ~ ~ ( cE @ sK3_SY6 ) ) )
= $true ),
inference(unfold_def,[status(thm)],[37]) ).
thf(40,plain,
( ( ~ ! [SX0: $i] :
( ~ ( sK1_Xx @ SX0 )
| ( cD @ SX0 ) )
| ~ ! [SX0: $i] :
( ~ ( sK1_Xx @ SX0 )
| ( cE @ SX0 ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[38]) ).
thf(41,plain,
( ( ~ ( sK1_Xx @ sK3_SY6 )
| ~ ~ ( cE @ sK3_SY6 ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[39]) ).
thf(42,plain,
( ( ~ ! [SX0: $i] :
( ~ ( sK1_Xx @ SX0 )
| ( cD @ SX0 ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[40]) ).
thf(43,plain,
( ( ~ ! [SX0: $i] :
( ~ ( sK1_Xx @ SX0 )
| ( cE @ SX0 ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[40]) ).
thf(44,plain,
( ( ~ ( sK1_Xx @ sK3_SY6 ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[41]) ).
thf(45,plain,
( ( ~ ~ ( cE @ sK3_SY6 ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[41]) ).
thf(46,plain,
( ( ! [SX0: $i] :
( ~ ( sK1_Xx @ SX0 )
| ( cD @ SX0 ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[42]) ).
thf(47,plain,
( ( ! [SX0: $i] :
( ~ ( sK1_Xx @ SX0 )
| ( cE @ SX0 ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[43]) ).
thf(48,plain,
( ( sK1_Xx @ sK3_SY6 )
= $true ),
inference(extcnf_not_neg,[status(thm)],[44]) ).
thf(49,plain,
( ( ~ ( cE @ sK3_SY6 ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[45]) ).
thf(50,plain,
! [SV3: $i] :
( ( ~ ( sK1_Xx @ SV3 )
| ( cD @ SV3 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[46]) ).
thf(51,plain,
! [SV4: $i] :
( ( ~ ( sK1_Xx @ SV4 )
| ( cE @ SV4 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[47]) ).
thf(52,plain,
( ( cE @ sK3_SY6 )
= $false ),
inference(extcnf_not_pos,[status(thm)],[49]) ).
thf(53,plain,
! [SV3: $i] :
( ( ( ~ ( sK1_Xx @ SV3 ) )
= $true )
| ( ( cD @ SV3 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[50]) ).
thf(54,plain,
! [SV4: $i] :
( ( ( ~ ( sK1_Xx @ SV4 ) )
= $true )
| ( ( cE @ SV4 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[51]) ).
thf(55,plain,
! [SV3: $i] :
( ( ( sK1_Xx @ SV3 )
= $false )
| ( ( cD @ SV3 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[53]) ).
thf(56,plain,
! [SV4: $i] :
( ( ( sK1_Xx @ SV4 )
= $false )
| ( ( cE @ SV4 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[54]) ).
thf(57,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[48,56,55,52]) ).
thf(58,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[57,35]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SEV233^5 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.13/0.33 % Computer : n026.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Tue Jun 28 16:47:47 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.34
% 0.13/0.34 No.of.Axioms: 0
% 0.13/0.34
% 0.13/0.34 Length.of.Defs: 0
% 0.13/0.34
% 0.13/0.34 Contains.Choice.Funs: false
% 0.13/0.34 (rf:0,axioms:0,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:2,loop_count:0,foatp_calls:0,translation:fof_full)..
% 0.19/0.38
% 0.19/0.38 ********************************
% 0.19/0.38 * All subproblems solved! *
% 0.19/0.38 ********************************
% 0.19/0.38 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:1,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:57,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.19/0.38
% 0.19/0.38 %**** Beginning of derivation protocol ****
% 0.19/0.38 % SZS output start CNFRefutation
% See solution above
% 0.19/0.38
% 0.19/0.38 %**** End of derivation protocol ****
% 0.19/0.38 %**** no. of clauses in derivation: 58 ****
% 0.19/0.38 %**** clause counter: 57 ****
% 0.19/0.38
% 0.19/0.38 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:1,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:57,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------